Problem set - PDFSEARCH.IO - Document Search Engine

Problem set
Results: 1590

#	Item
931	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
932	Algorithms CS 6820 Fall 2009 Problem Set 2 Due October 2, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-09-18 15:51:23 Polynomial NP Puzzles
933	Algorithms CS 6820 Fall 2009 Problem Set 3 Due October 9, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-10-21 16:42:28 Computer science NP-complete NP Low K Software engineering Conjunctive query Complexity classes Mathematical optimization Computing
934	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
935	Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-10-30 17:40:59 Graph operations Connectivity Tree decomposition Graph Travelling salesman problem Tree Line graph Chordal graph Graph theory NP-complete problems Graph coloring
936	LNCSA Continuous-Based Approach for Partial Clique Enumeration Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:12:13 NP-complete problems Graph operations Clique problem Clique Independent set Matching Networks Maximal independent set Cograph Graph theory Theoretical computer science Mathematics
937	3.034 Problem Set 3 DueShow 3 polymers that could be synthesized from the following monomers. Show the structure of the polymer and any byproducts. Add to Reading List Source URL: www.chemistry2011.org - Date: 2013-03-07 19:38:57
938	2012 LWS Heliophysics Summer School Problem Set on Turbulence and Heating in the Solar Wind 1. Turbulent Heating. Matthaeus & Goldstein (JGR, 87, 6011, 1982) analyzed an interval of slow-solar-wind data taken by instrum Add to Reading List Source URL: www.heliophysics.ucar.edu Language: English - Date: 2012-06-05 11:11:33 Plasma physics Water waves Fluid dynamics Corona Sun Turbulence Solar wind Plasma Proton Physics Space plasmas Light sources
939	The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch† Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:17:36 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Set cover problem Competitive analysis Algorithm Randomized rounding Euclidean algorithm Mathematics Theoretical computer science Applied mathematics
940	Microsoft Word - NLS Problem set Add to Reading List Source URL: www.chemistry2011.org Language: English - Date: 2013-03-09 18:21:12 Scattering Waves Harmonic oscillator Anharmonicity Ordinal number Damping Quantum harmonic oscillator Physics Ordinary differential equations Resonance

UPDATE